Using induction and rewriting to verify and complete parameterized specifications
نویسندگان
چکیده
منابع مشابه
Using Induction and Rewriting to Verify and Complete Parameterized Specifications
In software engineering there is a growing demand for formal methods for the specii-cation and validation of software systems. The formal development of a system might give rise to many proof obligations. We must prove the completeness of the speciication and the validity of some inductive properties. In this framework, many provers have been developed. However they require much user interactio...
متن کاملUsing Term Rewriting Systems to Design and Verify Processors Using Term Rewriting Systems to Design and Verify Processors
We present a novel use of Term Rewriting Systems (TRS's) to describe micro-architectures. The state of a system is represented as a TRS term while the state transitions are represented as TRS rules. TRS descriptions are amenable to both veriication and synthesis. We illustrate the use of TRS's by giving the operational semantics of a simple RISC instruction set. We then present another TRS that...
متن کاملUsing Term Rewriting to Verify Software
This paper describes a uniform approach to the automation of verification tasks associated with while statements, representation functions for abstract data types, generic program units and abstract base classes. Program units are annotated with equations containing symbols defined by algebraic axioms. An operation’s axioms are developed using strategies that guarantee crucial properties such a...
متن کاملUsing term rewriting systems to design and verify processors
We present a novel use of Term Rewriting Systems (TRS's) to describe micro-architectures. The state of a system is represented as a TRS term while the state transitions are represented as TRS rules. TRS descriptions are amenable to both veri cation and synthesis. We illustrate the use of TRS's by giving the operational semantics of a simple RISC instruction set. We then present another TRS that...
متن کاملUsing SPIN and STeP to Verify Business Processes Specifications
Business transactions are prone to failure and having to deal with unexpected situations. Some business process specification languages, e.g. StAC, introduce notions like compensation handling. Given the need of verification of correctness in business related software, it is important to fill in the gap between business process specification languages like StAC and the verification software alr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)80708-0